Computability of the Additive Complexity of Algebraic Circuits with Root Extracting
نویسندگان
چکیده
We design an algorithm for computing the generalized (algebraic circuits with root extracting, cf. P 81], J 81], GSY 93]) additive complexity of any rational function. It is the rst computability result of this sort on the additive complexity of algebraic circuits.
منابع مشابه
Computing the Additive Complexity of Algebraic Circuits with Root Extracting
We design an algorithm for computing the generalized (algebraic circuits with root extracting , cf. P 81], J 81], GSY 93]) additive complexity of any rational function. It is the rst computability result of this sort on the additive complexity of algebraic circuits.
متن کاملIs It Harder to Factor a Polynomial or to Find a Root?
For a computable field F , the splitting set S is the set of polynomials p(X) ∈ F [X] which factor over F , and the root set R is the set of polynomials with roots in F . Work by Frohlich and Shepherdson essentially showed these two sets to be Turing-equivalent, surprising many mathematicians, since it is not obvious how to compute S from R. We apply other standard reducibilities from computabi...
متن کاملTwo P-Complete Problems in the Theory of the Reals
A classical subject in computational complexity is what is usually called algebraic complexity. This area deals with the complexity of algorithms that take their inputs on R " , where R is a ring, understood as the number of ring operations the algorithm performs as a function of IZ, and the main kind of results are both upper and lower bounds. A recent survey about this topic is (von zur Gathe...
متن کاملOn Nc-real Complexity Classes for Additive Circuits and Their Relations with Nc on Nc-real Complexity Classes for Additive Circuits and Their Relations with Nc on Nc-real Complexity Classes for Additive Circuits and Their Relations with Nc
Based on the results of Blum, Shub and Smale 1], Meer 5], Cucker and Matamala 3] and Koiran 7], we develop the study of real computation models restricted to additive operations. More speciically we introduce some complexity classes deened by algebraic circuits and we study their relationships with the real computation model. We show that the languages accepted by nonuniform additive circuits o...
متن کاملA topological view on algebraic computation models
We investigate the topological aspects of some algebraic computation models, in particular the BSS-model. Our results can be seen as bounds on how different BSS-computability and computability in the sense of computable analysis can be. The framework for this is Weihrauch reducibility. As a consequence of our characterizations, we establish that the solvability complexity index is (mostly) inde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 157 شماره
صفحات -
تاریخ انتشار 1996